A Prototype Constraint Deductive Database System based on HH¬(C)
نویسندگان
چکیده
This paper presents, from a user point of view, a deductive database system based on Hereditary Harrop Formulas with Constraints and Negation, HH¬(C). The Prolog implementation of this system is based on a fixpoint semantics proposed in a previous work. The answer to a query posed to a database is intended as a constraint of the constraint system associated to C. We have developed several solvers for specific constraint domains, composed of data values and predefined functions and operators, including finite domains, real numbers, Boolean and user-defined enumerated types. They have been implemented by taking advantage of the underlying constraint solvers in SWI-Prolog. In the current version of the system, some improvements regarding the efficiency and the user interface have been introduced. In addition, we have included aggregate functions as count, sum, avg and min. We propose to use aggregate functions as components of the constraint language, so that solving of constraints including aggregate functions is delegated to the constraint solver.
منابع مشابه
Towards a Constraint Deductive Database Language based on Hereditary Harrop Formulas
In the same way that Datalog and Datalog with constraints arise when modelling databases inspired on Prolog and CLP (Constraint Logic Programming), respectively, we introduce the constraint logic programming scheme HH(C) (Hereditary Harrop formulas with Constraints) as the basis for a database language. We show that HH(C) can fulfill all relational algebra operations but set difference, so that...
متن کاملFormalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation
In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint deductive database query language. In addition to constraints, our proposal includes logical connectives (implication and quantifiers) for defining databases and queries, which altogether are unavailable in current datab...
متن کاملA Constraint Database System for Temporal Knowledge
This paper describes how the technology of deductive constraint database systems and constraint query languages can be used to represent and reason with tem poral knowledge First we summarize our approach to manipulating constraints over reals within deductive database sys tems This approach is based on the compile time rewriting of clauses which are not admissible Then we show how the timestam...
متن کاملThe GPR System : an Architecture for Integrating Active andDeductive
This paper illustrates a prototype system, called GPRS, supporting the Generalized Production Rules (GPR) database language. The GPR language integrates, in a uniied framework, active rules, which allow the speciica-tion of event driven computations on data, and deductive rules, which can be used to derive intensional relations in the style of logic programming. The prototype realizes the opera...
متن کاملAn Object-Oriented Front-end for Deductive Databases
We present the Orlog deductive object oriented database system prototype The implementation of the system relies on the idea of reducing inheritance to deduction and giving a relational interpretation to every Orlog database The prototype is a user transparent front end for coral deductive database system and provides a full edgedprogrammingenvironment in Orlog
متن کامل